Robust affine registration method using line/surface normals and correntropy criterion

نویسندگان

چکیده

Abstract The problem of matching point clouds is an efficient way registration, which significant for many research fields including computer vision, machine learning, and robotics. There may be linear or non-linear transformation between clouds, but determining the affine relation more challenging among cases. Various methods have been presented to overcome this in literature one them variant iterative closest (ICP) algorithm. However, traditional ICP variants are highly sensitive effects such as noises, deformations, outliers; least-square metric substituted with correntropy criterion increase robustness ICPs effects. Correntropy-based robust available use point-to-point estimate clouds. Conversely, study, a line/surface normal that examines point-to-curve point-to-plane distances employed together cloud registration problems. First, maximum measure built conditions. Then, closed-form solution maximizes similarity sets achieved 2D extended 3D registration. Finally, application procedure developed method given its performance examined through extensive experiments on sets. results highlight our can align robustly precisely than state-of-the-art literature, while time process remains at reasonable levels.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust Affine Image Registration Method

Image registration has many real life applications. Affine image registration is one of the commonly-used parametric models. Iterative solution methods for the underlying least squares problem suffer from convergence problems whenever good initial guesses are not available. Variational models are non-parametric deformable models that have been proposed based on least squares fitting and regular...

متن کامل

Robust and stable gene selection via Maximum-Minimum Correntropy Criterion.

One of the central challenges in cancer research is identifying significant genes among thousands of others on a microarray. Since preventing outbreak and progression of cancer is the ultimate goal in bioinformatics and computational biology, detection of genes that are most involved is vital and crucial. In this article, we propose a Maximum-Minimum Correntropy Criterion (MMCC) approach for se...

متن کامل

Robust diffusion maximum correntropy criterion algorithm for distributed network estimation

Robust diffusion algorithms based on the maximum correntropy criterion(MCC) are developed to address the distributed networks estimation issue in impulsive(long-tailed) noise environments. The cost functions used in distributed network estimation are in general based on the mean square error (MSE) criterion, which is optimal only when the measurement noise is Gaussian. In non-Gaussian situation...

متن کامل

Robust Hammerstein Adaptive Filtering under Maximum Correntropy Criterion

The maximum correntropy criterion (MCC) has recently been successfully applied to adaptive filtering. Adaptive algorithms under MCC show strong robustness against large outliers. In this work, we apply the MCC criterion to develop a robust Hammerstein adaptive filter. Compared with the traditional Hammerstein adaptive filters, which are usually derived based on the well-known mean square error ...

متن کامل

Robust Deep Network with Maximum Correntropy Criterion for Seizure Detection

Effective seizure detection from long-term EEG is highly important for seizure diagnosis. Existing methods usually design the feature and classifier individually, while little work has been done for the simultaneous optimization of the two parts. This work proposes a deep network to jointly learn a feature and a classifier so that they could help each other to make the whole system optimal. To ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complex & Intelligent Systems

سال: 2022

ISSN: ['2198-6053', '2199-4536']

DOI: https://doi.org/10.1007/s40747-021-00599-0